Nearest neighbour distance and dimension of intensity measure of Poisson point process
نویسندگان
چکیده
منابع مشابه
Nearest Neighbour Distance Matrix Classification
A distance based classification is one of the popular methods for classifying instances using a point-to-point distance based on the nearest neighbour or k-NEAREST NEIGHBOUR (k-NN). The representation of distance measure can be one of the various measures available (e.g. Euclidean distance, Manhattan distance, Mahalanobis distance or other specific distance measures). In this paper, we propose ...
متن کاملdedekind modules and dimension of modules
در این پایان نامه، در ابتدا برای مدول ها روی دامنه های پروفر شرایط معادل به دست آورده ایم و خواصی از ددکیند مدول ها روی دامنه های پروفر مشخص کرده ایم. در ادامه برای ددکیند مدول های با تولید متناهی روی حلقه های به طور صحیح بسته شرایط معادل به دست آورده ایم و ددکیند مدول های ضربی را مشخص کرده ایم. گزاره هایی در مورد بعد ددکیند مدول ها بیان کرده ایم. در پایان، قضایای lying over و going down را برا...
15 صفحه اولEstimating Density and Dispersion from Truncated or Unrestricted Joint Point - Distance Nearest - Neighbour Distances
Forty computer.simulated populations were analysed to derive fonnulae for estimating den.5ity of populations from a set of distances from sample points to the nearest member, from that member to its neighbour and from that neighbour to its nearest neighbour. Distances may be truncated or unlimited. The formulae were applied to data from 11 paper.dot and 18 field populations in a total of 37 exp...
متن کاملOn the nearest neighbour interchange distance between evolutionary trees.
We present some new results on a well-known distance measure between evolutionary trees. The trees we consider are free 3-trees having n leaves labeled 0,...,n - 1 (representing species), and n - 2 internal nodes of degree 3. The distance between two trees is the minimum number of nearest neighbour interchange (NNI) operations required to transform one into the other. First, we improve an upper...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2011
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-2010-10467-7